Approximation and hardness of Shift-Bribery

In the Shift-Bribery problem we are given an election, a preferred candidate, and costs of shifting this candidate up voters' preference orders. The goal is to find such set shifts that ensures wins election. We give first polynomial-time approximation scheme for case positional scoring rules, Copeland rule show strong inapproximability results.